Distances in random Apollonian network structures†
نویسندگان
چکیده
In this paper, we study the distribution of distances in random Apollonian network structures (RANS), a family of graphs which has a one-to-one correspondence with planar ternary trees. Using multivariate generating functions that express all information on distances, and singularity analysis for evaluating the coefficients of these functions, we prove a Rayleigh limit distribution for distances to an outermost vertex, and show that the average value of the distance between any pair of vertices in a RANS of order n is asymptotically √ n. Résumé. Nous étudions dans ce papier la distribution des distances dans les structures des réseaux apolloniens aléatoires (RANS), une famille de graphes en bijection avec les arbres ternaires planaires. En s’appuyant sur l’utilisation de séries génératrices multivariées pour décrire toute l’information sur les distances, ainsi que sur l’analyse de singularités pour évaluer les coefficients de ces séries, nous prouvons une distribution limite de Rayleigh pour les distances vers un sommet externe du RANS et montrons que la distance moyenne entre deux sommets quelconques d’un RANS d’ordre n est asymptotiquement √ n.
منابع مشابه
Degree distribution of random Apollonian network structures and Boltzmann sampling
Random Apollonian networks have been recently introduced for representing real graphs. In this paper we study a modified version: random Apollonian network structures (RANS), which preserve the interesting properties of real graphs and can be handled with powerful tools of random generation. We exhibit a bijection between RANS and ternary trees, that transforms the degree of nodes in a RANS int...
متن کاملWheel Random Apollonian Graphs
In this paper a subset of High-Dimensional Random Apollonian networks, that we called Wheel Random Apollonian Graphs (WRAG), is considered. We show how to generate a Wheel Random Apollonian Graph from a wheel graph. We analyse some basic graph properties like vertices and edges cardinality, some question concerning cycles and the chromaticity in such type of graphs, we suggest further work on t...
متن کاملLong Paths in Random Apollonian Networks
We consider the length L(n) of the longest path in a randomly generated Apollonian Network (ApN) An. We show that w.h.p. L(n) ≤ ne− log c n for any constant c < 2/3.
متن کاملThe Degree Sequence of Random Apollonian Networks
We analyze the asymptotic behavior of the degree sequence of Random Apollonian Networks [11]. For previous weaker results see [10, 11].
متن کامل